package day7;

public class demo2 {
    public static void main(String[] args) {

    }

    int []dx={0,0,1,-1};
    int []dy={1,-1,0,0};
    boolean [][]vbs;
    int m,n;
    int ret=0;
    public int solve (char[][] grid) {
        m= grid.length;
        n=grid[0].length;
        vbs=new boolean[m][n];
        for (int i = 0; i <m ; i++) {
            for (int j = 0; j <n ; j++) {
                if(grid[i][j]=='1'&&!vbs[i][j]){
                    dfs(grid,i,j);
                    ret++;
                }

            }
        }
        return ret;
    }

    public void dfs(char[][]grid,int i,int j){
        vbs[i][j]=true;
        for (int k = 0; k <4 ; k++) {
            int x=i+dx[k];
            int y=j+dy[k];
            if(x>=0&&x<m&&y>=0&&y<n&&grid[x][y]=='1'&&!vbs[x][y]){
                vbs[x][y]=true;
                dfs(grid,x,y);
            }
        }
    }


}
